A maximum-rank minimum-term-rank theorem for matroids
نویسندگان
چکیده
منابع مشابه
Enumerating Matroids of Fixed Rank
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that s(n) ∼ m(n), where m(n) denotes the number of matroids on a fixed groundset of size n, and s(n) the number of sparse paving matroids. In an earlier paper, we showed that log s(n) ∼ logm(n). The bounds that we used for that result were dominated by matroids of rank r ≈ n/2. In this paper we consider the ...
متن کاملRank-Three Matroids are Rayleigh
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.
متن کاملMinimum Rank, Maximum Nullity, and Zero Forcing of Graphs
Combinatorial matrix theory, which involves connections between linear algebra, graph theory, and combinatorics, is a vital area and dynamic area of research, with applications to fields such as biology, chemistry, economics, and computer engineering. One area generating considerable interest recently is the study of the minimum rank of matrices associated with graphs. Let F be any field. For a...
متن کاملA generalization of Ryser's theorem on term rank
In his work on classes of (0, 1 )-matrices with given row and column sum vectors, Herbert Ryser proved that the maximum term rank possible in a normalized class, p, can be realized by a matrix having p (independent) l ' s in positions ( 1 , p ) , ( 2 , p 1) . . . . . (p, 1). We study the positions occupied by sets of t ~<p independent l 's. 1. I n t r o d u c t i o n Let m and n be positive int...
متن کاملMinimum Rank Problems
A graph describes the zero-nonzero pattern of a family of matrices, with the type of graph (undirected or directed, simple or allowing loops) determining what type of matrices (symmetric or not necessarily symmetric, diagonal entries free or constrained) are described by the graph. The minimum rank problem of the graph is to determine the minimum among the ranks of the matrices in this family; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1975
ISSN: 0024-3795
DOI: 10.1016/0024-3795(75)90004-x